Approximation By Trigonometric Polynomials
نویسنده
چکیده
These notes are prepared as lecture notes exclusively for the participants of this conference only. Any reproduction in any media, or any use for any other purpose of any part of this manuscript, without an expressed written consent of the author is unlawful.thorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon. The views and conclusions contained herein are those of the author and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of the Air Force Office of Scientific Research or the U.S. Government.
منابع مشابه
Approximation by Trigonometric Polynomials in Weighted Rearrangement Invariant Spaces
We investigate the approximation properties of trigonometric polynomials and prove some direct and inverse theorems for polynomial approximation in weighted rearrangement invariant spaces.
متن کاملSensitivity analysis for Szegő polynomials
Szegő polynomials are orthogonal with respect to an inner product on the unit circle. Numerical methods for weighted least-squares approximation by trigonometric polynomials conveniently can be derived and expressed with the aid of Szegő polynomials. This paper discusses the conditioning of several mappings involving Szegő polynomials and, thereby, sheds light on the sensitivity of some approxi...
متن کاملA Note on Newbery’s Algorithm for Discrete Least-squares Approximation by Trigonometric Polynomials
Recently fast, efficient and reliable algorithms for discrete least-squares approximation of a real-valued function given at arbitrary distinct nodes in [0, 2π) by trigonometric polynomials were presented in different papers. These algorithms are based on schemes for the solution of inverse unitary eigenproblems and require only O(mn) arithmetic operations as compared to O(mn) operations needed...
متن کاملApproximation of multivariate functions by trigonometric polynomials based on rank-1 lattice sampling
In this paper, we present algorithms for the approximation of multivariate functions by trigonometric polynomials. The approximation is based on sampling of multivariate functions on rank-1 lattices. To this end, we study the approximation of functions in periodic Sobolev spaces of dominating mixed smoothness. Recently an algorithm for the trigonometric interpolation on generalized sparse grids...
متن کاملApproximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
In this paper, we present algorithms for the approximation of multivariate periodic functions by trigonometric polynomials. The approximation is based on sampling of multivariate functions on rank-1 lattices. To this end, we study the approximation of periodic functions of a certain smoothness. Our considerations include functions from periodic Sobolev spaces of generalized mixed smoothness. Re...
متن کاملExtremal Positive Trigonometric Polynomials
There are various reasons for the interest in the problem of constructing nonnegative trigonometric polynomials. Among them are: Cesàro means and Gibbs’ phenomenon of the the Fourier series, approximation theory, univalent functions and polynomials, positive Jacobi polynomial sums, orthogonal polynomials on the unit circle, zero-free regions for the Riemann zeta-function, just to mention a few....
متن کامل